NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
621	Willson Algorithms for Molecular Biology 2012, 7:13 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Complexity classes NP-complete problems Mathematical optimization NP P versus NP problem Graph Tree Directed graph Theoretical computer science Computational complexity theory Mathematics
622	How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-23 10:13:29 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Mathematical optimization Vertex cover Dominating set Time complexity FO Theoretical computer science Computational complexity theory Applied mathematics
623	Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-04-13 00:26:28 NP-complete problems Automated theorem proving Constraint programming Boolean algebra Formal methods DPLL algorithm Boolean satisfiability problem Conjunctive normal form Lookup table Theoretical computer science Applied mathematics Mathematics
624	Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-07 01:33:40 String Combinatorics NP-complete problems Formal languages Substring Longest common subsequence problem Subsequence Approximate string matching String searching algorithm Mathematics Dynamic programming Theoretical computer science
625	18 PUZZLES TUESDAY JANUARYHOROSCOPES Add to Reading List Source URL: www.territorystories.nt.gov.au Language: English - Date: 2015-03-04 17:41:34 Logic puzzles Games Cryptic crossword Sudoku Human behavior Word square Classical cipher NP-complete problems Crosswords Leisure
626	PUZZLES 13 THURSDAY JANUARYHOROSCOPES Add to Reading List Source URL: www.territorystories.nt.gov.au Language: English - Date: 2015-03-15 20:38:53 Leisure Games Logic puzzles Cryptic crossword Sudoku Word square Classical cipher NP-complete problems Crosswords Mathematics
627	Interval Scheduling and Colorful Independent Sets Ren´e van Bevern1,∗ , Matthias Mnich2 , Rolf Niedermeier1 , and Mathias Weller1,† 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-11-07 08:24:33 Clique Interval graph Independent set Claw-free graph Matching Cograph Path decomposition Maximal independent set Graph theory NP-complete problems Graph operations
628	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
629	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
630	Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 NP-complete problems Combinatorial optimization Matching Degree Maximum flow problem Graph coloring Dominating set Mathematics Graph theory Theoretical computer science

UPDATE